- hy|phen|a|tion
- hy|phen|a|tion «HY fuh NAY shuhn», noun.the act of joining by a hyphen; writing or printing with a hyphen.
Useful english dictionary. 2012.
Useful english dictionary. 2012.
tion — ab·bre·vi·a·tion; ab·di·ca·tion; ab·duc·tion; ab·er·ra·tion; ab·er·ra·tion·al; ab·jec·tion; ab·junc·tion; ab·ju·ra·tion; ab·lac·ta·tion; ab·la·tion; ab·lu·tion; ab·mi·gra·tion; ab·ne·ga·tion; ab·o·li·tion; ab·o·li·tion·ary; ab·o·li·tion·dom;… … English syllables
hy|phen|i|za|tion — «HY fuh nuh ZAY shuhn», noun. = hyphenation. (Cf. ↑hyphenation) … Useful english dictionary
hyphenization — hy·phen·iza·tion … English syllables
iza — al·co·hol·iza·tion; car·a·mel·iza·tion; chris·tian·iza·tion; com·fort·iza·tion; de·mon·iza·tion; diph·thong·iza·tion; en·thron·iza·tion; es·trin·iza·tion; ether·iza·tion; eu·ro·pe·an·iza·tion; ex·ten·sion·al·iza·tion; ex·te·ri·or·iza·tion;… … English syllables
hyphenate — hy|phen|ate [ haıfə,neıt ] verb intransitive or transitive to join words or parts of a word using a hyphen ╾ hy|phen|a|tion [ ,haıfə neıʃn ] noun uncount … Usage of the words and phrases in modern English
hyphenate — hy•phen•ate v. [[t]ˈhaɪ fəˌneɪt[/t]] adj., n. [[t] nɪt, ˌneɪt[/t]] v. at•ed, at•ing, adj. n. 1) to join by a hyphen 2) to write or divide with a hyphen 3) hyphenated 4) cvb a person working in more than one craft or occupation: a hyphenate in the … From formal English to slang
TeX — infobox software name = TeX developer = Donald Knuth latest release version = 3.1415926 latest release date = March 2008 operating system = Cross platform genre = Typesetting license = Permissive website = http://www.tug.org/TeX (pronEng|ˈtɛx, as … Wikipedia
Trie — A trie for keys A , to , tea , ted , ten , i , in , and inn . In computer science, a trie, or prefix tree, is an ordered tree data structure that is used to store an associative array where the keys are usually strings. Unlike a binary search… … Wikipedia
Hyphenation algorithm — A hyphenation algorithm is a set of rules (especially one codified for implemention in a computer program) that decides at which points a word can be broken over two lines with a hyphen. For example, a hyphenation algorithm might decide that… … Wikipedia
Hash trie — In computer science, hash trie refers to two kinds of data structure:* A space efficient implementation of a sparse trie, in which the descendants of each node may be interleaved in memory. (The name is suggested by a similarity to a closed hash… … Wikipedia